Hierarchical Visibility in TerrainsA
نویسنده
چکیده
This paper describes a hierarchical visibility technique that signiicantly accelerates terrain rendering. With this technique, large parts of the terrain that are hidden from the viewpoint are culled, thus avoiding the expense of uselessly sending them down the graphics pipeline (only to nd in the z{buuer step that they are hidden). The hierarchical visibility technique has been implemented in a multiresolution terrain rendering algorithm and experimental results show very large speedups in some situations.
منابع مشابه
Exploiting coherence in hierarchical visibility algorithms
We present a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visib...
متن کاملHierarchical Techniques for Visibility Computations
Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...
متن کاملGuaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing visibility errors. We build a hierarchy of large convex occluders using face clustering. This structure is efficiently exploited to avoid computing visibility between mutually fully occluded scene elements. Used in con...
متن کاملEdge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of preprocessing. However, Visibility Graphs are known to perform poorly in terms of running time, es...
متن کاملComparison of Error Tree Analysis and TRIPOD BETA in Accident Analysis of a Power Plant Industry Using Hierarchical Analysis
Introduction: Due to the importance and necessity of accident analysis, it is necessary to use proper technique for precise accident analysis and to provide corrective and preventive measures to prevent recurrence of an accident. Method: In this descriptive-analytical paper, the most important criteria for investigating and selecting accident investigation and analysis techniques and selecting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997